Polycyclic-by-finite groups and first-order sentences
نویسندگان
چکیده
منابع مشابه
Describing Finite Groups by Short First-order Sentences
We say that a class of finite structures for a finite signature is r-compressible if each structure G in the class has a first-order description of size at most O(r(|G|)). We show that the class of finite simple groups is log-compressible, and the class of all finite groups is log-compressible. The result relies on the classification of finite simple groups, the bi-interpretability of the small...
متن کاملSeparating Classes of Groups by First-Order Sentences
For various proper inclusions of classes of groups C D, we nd a group H 2 D and a rst{order sentence ' such that H j = ' but no G 2 C sat-isses '. The classes we consider include the classes of nite, nitely presented, nitely generated with and without solvable word problem, and all countable groups. For one separation, we give an exampleof a f.g. group, namely ZpoZfor some prime p, which is the...
متن کاملAlgorithms for Polycyclic-by-finite Groups Algorithms for Polycyclic-by-finite Groups Table of Contents
OF THE DISSERTATION Algorithms for Polycyclic-by-Finite Groups by Gretchen Ostheimer Dissertation Director: Professor Charles C. Sims Let R be a number eld. We present several algorithms for working with polycyclicbynite subgroups of GL(n;R). Let G be a subgroup of GL(n;R) given by a nite generating set of matrices. We describe an algorithm for deciding whether or not G is polycyclic-bynite. Fo...
متن کاملAutomorphism groups of polycyclic-by-finite groups and arithmetic groups
We show that the outer automorphism group of a polycyclic-by-finite group is an arithmetic group. This result follows from a detailed structural analysis of the automorphism groups of such groups. We use an extended version of the theory of the algebraic hull functor initiated by Mostow. We thus make applicable refined methods from the theory of algebraic and arithmetic groups. We also construc...
متن کاملAlgorithms for polycyclic-by-finite matrix groups
Let K be a number eld. We present several algorithms for working with polycyclic-by-nite subgroups of GL(n; K). Let G be a subgroup of GL(n; K) given by a nite generatingset of matrices. We describe an algorithm for deciding whether or not G is polycyclic-by-nite. For polycyclic-by-nite G, we describe an algorithm for deciding whether or not a given matrix is an element of G. We also describe a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2013
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2013.08.008